A Refinement Theory that Supports Reasoning About Knowledge and Time
نویسندگان
چکیده
An expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of multiple agents is developed. The refinement calculus owes the cleanliness of its decomposition rules for all programming language constructs and the relative simplicity of its semantic model to a rigid synchrony assumption which requires all agents and the environment to proceed in lockstep. The new features of the calculus are illustrated in a derivation of the two-phase-commit protocol.
منابع مشابه
A Program Refinement Framework Supporting Reasoning about Knowledge and Time ( Preliminary Report ) Kai Engelhardt
This paper develops a highly expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of a single agent. The framework generalizes a previously developed temporal refinement framework by amalgamating it with a logic of quantified local propositions, a generalization of the logic of knowledge. The combined framework provides a f...
متن کاملA Program Refinement Framework Supporting Reasoning about Knowledge and Time
This paper develops a highly expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of a single agent. The framework generalizes a previously developed temporal refinement framework by amalgamating it with a logic of quantified local propositions, a generalization of the logic of knowledge. The combined framework provides a f...
متن کاملComprehension of factual, nonfactual, and counterfactual conditionals by Iranian EFL learners
A considerable amount of studies have been established on conditional reasoning supporting mental model theory of propositional reasoning. Mental model theory proposed by Johnson- larid and Byrne is an explanation of someone's thought process about how something occurs in the real world. Conditional reasoning as a kind of reasoning is the way to speak about possibilities or probabilities. The a...
متن کاملINTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING
Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...
متن کاملA Proper Ontology for Reasoning about Knowledge and Planning
Research on the knowledge preconditions problems for actions and plans has sought to answer the following questions: (1) When does an agent know enough to perform an action? (2) When can an agent execute a multi-agent plan? It has been assumed that the choice of temporal ontology is not crucial. This paper shows that this assumption is wrong and that it is very diicult to develop within existin...
متن کامل